On interplay of quantifiers in Gödel-Dummett fuzzy logics
نویسندگان
چکیده
Axiomatization of Gödel-Dummett predicate logics S2G, S3G, and PG, where PG is the weakest logic in which all prenex operations are sound, and the relationships of these logics to logics known from the literature are discussed. Examples of non-prenexable formulas are given for those logics where some prenex operation is not available. Inter-expressibility of quantifiers is explored for each of the considered logics.
منابع مشابه
Decidability of Quantified Propositional Intuitionistic Logic and S4 on Trees of Height and Arity ≤ω
Quantified propositional intuitionistic logic is obtained from propositional intuitionistic logic by adding quantifiers ∀p, ∃p, where the propositional variables range over upward-closed subsets of the set of worlds in a Kripke structure. If the permitted accessibility relations are arbitrary partial orders, the resulting logic is known to be recursively isomorphic to full second-order logic (K...
متن کاملTruth Values and Connectives in Some Non-Classical Logics
The question as to whether the propositional logic of Heyting, which was a formalization of Brouwer's intuitionistic logic, is finitely many valued or not, was open for a while (the question was asked by Hahn). Kurt Gödel (1932) introduced an infinite decreasing chain of intermediate logics, which are known nowadays as Gödel logics, for showing that the intuitionistic logic is not finitely (man...
متن کاملKripke semantics for fuzzy logics
Kripke frames (and models) provide a suitable semantics for sub-classical logics; for example Intuitionistic Logic (of Brouwer and Heyting) axiomatizes the reflexive and transitive Kripke frames (with persistent satisfaction relations), and the Basic Logic (of Visser) axiomatizes transitive Kripke frames (with persistent satisfaction relations). Here, we investigate whether Kripke frames/models...
متن کاملNote on inter-expressibility of logical connectives in finitely-valued Gödel-Dummett logics
Let Gm be the m-valued Gödel-Dummett fuzzy logic. If m ≥ 3 then neither conjunction nor implication is in Gm expressible in terms of the remaining connectives. This fact remains true even if the propositional language is enriched by propositional constants for all truth values. Gödel-Dummett fuzzy propositional logic can be defined as an extension of the intuitionistic propositional logic by th...
متن کاملFormal systems of fuzzy logic and their fragments
Formal systems of fuzzy logic (including the well-known à Lukasiewicz and Gödel-Dummett infinite-valued logics) are well-established logical systems and respected members of the broad family of the so-called substructural logics closely related to the famous logic BCK. The study of fragments of logical systems is an important issue of research in any class of nonclassical logics. Here we study ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Arch. Math. Log.
دوره 45 شماره
صفحات -
تاریخ انتشار 2006